Alternating paths through disjoint line segments
نویسندگان
چکیده
We show that every segment endpoint visibility graph on disjoint line segments in the plane admits an alternating path of length , answering a question of Bose. This bound is optimal apart from a constant factor. We also give bounds on the constants hidden by the asymptotic notation.
منابع مشابه
Alternating Paths along Axis-Parallel Segments
It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length Ω( √ n). This bound is best possible in the worst case. In the special case that the n pairwise disjoint axis-parallel line segments are protruded (that is, if the intersection point of the lines through every two nonparallel segments is not visible from both...
متن کاملAlternating Paths along Orthogonal Segments
It was shown recently that in the segment endpoint visibility graph Vis(S) of any set S of n disjoint line segments in the plane, there is an alternating path of length (log n), and this bound best possible apart from a constant factor. This talk focuses on the variant of the problem where S is a set of n disjoint axis-parallel line segments, and shows that the length of a longest alternating p...
متن کاملConstructing Pairwise Disjoint Paths with
Let P be a simple polygon and let f(ui; u 0 i)g be m pairs of distinct vertices of P where for every distinct i; j m, there exist pairwise disjoint paths connecting ui to u 0 i and uj to u 0 j. We wish to construct m pairwise disjoint paths in the interior of P connecting ui to u 0 i for i = 1; : : : ; m, with minimal total number of line segments. We give an approximation algorithm which in O(...
متن کاملLINE-SEGMENTS CRITICAL SLIP SURFACE IN EARTH SLOPES USING AN OPTIMIZATION METHOD
In this paper the factor of safety (FS) and critical line-segments slip surface obtained by the Alternating Variable Local Gradient (AVLG) optimization method was presented as a new topic in 2D. Results revealed that the percentage of reduction in the FS obtained by switching from a circular shape to line segments was higher with the AVLG method than other methods. The 2D-AVLG optimization meth...
متن کاملHamiltonian Alternating Paths on Bicolored Double-Chains
We find arbitrarily large finite sets S of points in general position in the plane with the following property. If the points of S are equitably 2-colored (i.e., the sizes of the two color classes differ by at most one), then there is a polygonal line consisting of straight-line segments with endpoints in S, which is Hamiltonian, non-crossing, and alternating (i.e., each point of S is visited e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 87 شماره
صفحات -
تاریخ انتشار 2003